Abbreviating Z
نویسنده
چکیده
منابع مشابه
The Shortest Single Axioms for Groups of Exponent 4
We study equations of the form (= x) which are single axioms for groups of exponent 4, where is a term in product only. Every such must have at least 9 variable occurrences, and there are exactly three such of this size, up to variable renaming and mirroring. These terms were found by an exhaustive search through all terms of this form. Automated techniques were used in two ways: to eliminate m...
متن کاملRobust Approach to Abbreviating Terms: A Discriminative Latent Variable Model with Global Information
The present paper describes a robust approach for abbreviating terms. First, in order to incorporate non-local information into abbreviation generation tasks, we present both implicit and explicit solutions: the latent variable model, or alternatively, the label encoding approach with global information. Although the two approaches compete with one another, we demonstrate that these approaches ...
متن کاملScientific author names: errors, corrections, and identity profiles
Authorship problems are deep-rooted in the field of science communication. Some of these relate to lack of specific journal instructions. For decades, experts in journal editing and publishing have been exploring the authorship criteria and contributions deserving either co-authorship or acknowledgment. The issue of inconsistencies of listing and abbreviating author names has come to the fore l...
متن کاملUsing a genetic algorithm to abbreviate the Psychopathic Personality Inventory-Revised (PPI-R).
Some self-report measures of personality and personality disorders, including the widely used Psychopathic Personality Inventory-Revised (PPI-R), are lengthy and time-intensive. In recent work, we introduced an automated genetic algorithm (GA)-based method for abbreviating psychometric measures. In Study 1, we used this approach to generate a short (40-item) version of the PPI-R using 3 large-N...
متن کاملTechnical Report: Towards Algorithmic Cut-Introduction
We describe a method for abbreviating an analytic proof in classical first-order logic by the introduction of a lemma. Our algorithm is based on first computing a compressed representation of the terms present in the analytic proof and then a cut-formula that realizes such a compression. This method can be applied to the output of automated theorem provers, which typically produce analytic proofs.
متن کامل